package com.dong.binaryTree;
/*
递归的实现就是：每一次递归调用都会把函数的局部变量、参数值和返回地址等压入调用栈中
 */
public class TreeNodeDefine {
    int val;//存放值
    TreeNodeDefine left;//指向左节点
    TreeNodeDefine right;//指向右节点
    TreeNodeDefine(){};
    TreeNodeDefine(int val){
        this.val = val;
    }

    public TreeNodeDefine(int val, TreeNodeDefine left, TreeNodeDefine right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}

